The cμ/θ rule for many-server queues with abandonment
نویسندگان
چکیده
We consider a multi-class queueing system with multiple homogeneous servers and customer abandonment. For each customer class i, the holding cost per unit time, the service rate and the abandonment rate are denoted by ci, μi and θi, respectively. We prove that under a many-server fluid scaling and overload conditions, a routing policy that assigns priority to classes according to their index ciμi/θi, is asymptotically optimal for minimizing the overall long run average holding cost. An additional penalty on customer abandonment is easily incorporated into this model and leads to a similar index rule.
منابع مشابه
A cμ rule for parallel servers with two-tiered cμ preferences
The cμ rule is known to be optimal in many queueing systems with memoryless service times. We establish a cμ rule for a parallel flexible server system with two tiers. Multiple job classes arrive and wait in separate queues. The first tier contains classes that can only be served by one server and the second tier contains a class that can be served by all servers. The cμ preferences give priori...
متن کاملA ℂµ Rule for Two-Tiered Parallel Servers
The cμ rule is known to be optimal in many queueing systems with memoryless service and inter-arrival times. We establish a cμ rule for a parallel flexible server system with two tiers. Multiple job classes arrive and wait in separate queues. The first tier contains classes that can only be served by one server each, and the second tier contains a class that can be served by all servers. The cμ...
متن کاملOn the asymptotic optimality of the cμ/θ rule under ergodic cost
We consider an overloaded multi-server multi-class queueing model where customers may abandon while waiting to be served. For class i, service is provided at rate μi , and abandonment occurs at rate θi . In a many-server fluid regime, we show that prioritizing the classes in decreasing order of ciμi/θi asymptotically minimizes an ergodic holding cost, where ci denotes the equivalent holding cos...
متن کاملOn Learning the cμ Rule: Single and Multiserver Settings
We consider learning-based variants of the cμ rule – a classic and well-studied scheduling policy – in single and multi-server settings for multi-class queueing systems. In the single server setting, the cμ rule is known to minimize the expected holdingcost (weighted queue-lengths summed both over classes and time). We focus on the setting where the service rates μ are unknown, and are interest...
متن کاملMany-server Queues with Customer Abandonment: a Survey of Diffusion and Fluid Approximations
The performance of a call center is sensitive to customer abandonment. In this survey paper, we focus on / / G GI n GI parallel-server queues that serve as a building block to model call center operations. Such a queue has a general arrival process (the G ), independent and identically distributed (iid) service times with a general distribution (the first GI ), and iid patience times with a g...
متن کامل